Quotients of rigid graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quotients of Normal Edge-Transitive Cayley Graphs

The symmetry properties of mathematical structures are often important for understanding these structures. Graphs sometimes have a large group of symmetries, especially when they have an algebraic construction such as the Cayley graphs. These graphs are constructed from abstract groups and are vertex-transitive and this is the reason for their symmetric appearance. Some Cayley graphs have even ...

متن کامل

l 1 - Rigid Graphs

An l 1-graph is a graph whose nodes can be labeled by binary vectors in such a way that the Hamming distance between the binary addresses is, up to scale, the distance in the graph between the corresponding nodes. We show that many interesting graphs are l 1-rigid, i.e., that they admit an essentially unique such binary labeling.

متن کامل

Geometric Sensitivity of Rigid Graphs

Let (G, p) be an infinitesimally rigid d-dimensional bar-and-joint framework and let L be an equilibrium load on p. The load can be resolved by appropriate stresses wi,j , ij ∈ E(G), in the bars of the framework. Our goal is to identify the following parts (zones) of the framework: (i) when the location of an unloaded joint v is slightly perturbed, and the same load is applied, the stress will ...

متن کامل

Rigid Components of Random Graphs

The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P , up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated Maxwell-Laman Theorem from Rigidity Theory says that, generically, the rigidity problem has a combinatorial answer: the underlying combinatorial structure must co...

متن کامل

Rigid tensegrity labelings of graphs

Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, which provide upper and/or lower bounds for the distance between their endpoints. The graph of the framework, in which edges are labeled as bars, cables, and struts, is called a tensegrity graph. It is said to be rigid inRd if it has an infinitesimally rigid realization inRd as a tensegrity frame...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1981

ISSN: 0095-8956

DOI: 10.1016/0095-8956(81)90052-6